TSTP Solution File: GEG002^1 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : GEG002^1 : TPTP v6.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n096.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:21:31 EDT 2014

% Result   : Timeout 300.08s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : GEG002^1 : TPTP v6.1.0. Released v4.1.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n096.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 07:23:36 CDT 2014
% % CPUTime  : 300.08 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% Failed to open /home/cristobal/cocATP/CASC/TPTP/Axioms/LCL014^0.ax, trying next directory
% FOF formula (<kernel.Constant object at 0x17a46c8>, <kernel.Type object at 0x1293878>) of role type named reg_type
% Using role type
% Declaring reg:Type
% FOF formula (<kernel.Constant object at 0x17a4320>, <kernel.DependentProduct object at 0x1293ea8>) of role type named c_type
% Using role type
% Declaring c:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x17a4290>, <kernel.DependentProduct object at 0x17a4320>) of role type named dc_type
% Using role type
% Declaring dc:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x17a4cf8>, <kernel.DependentProduct object at 0x13c5ef0>) of role type named p_type
% Using role type
% Declaring p:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x17a4320>, <kernel.DependentProduct object at 0x13c5f80>) of role type named eq_type
% Using role type
% Declaring _TPTP_eq:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x17a46c8>, <kernel.DependentProduct object at 0x13c5d40>) of role type named o_type
% Using role type
% Declaring o:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x17a46c8>, <kernel.DependentProduct object at 0x13c5e60>) of role type named po_type
% Using role type
% Declaring po:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x1293ea8>, <kernel.DependentProduct object at 0x13c5c20>) of role type named ec_type
% Using role type
% Declaring ec:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x1293b00>, <kernel.DependentProduct object at 0x13c5cb0>) of role type named pp_type
% Using role type
% Declaring pp:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x1293ea8>, <kernel.DependentProduct object at 0x13c5ef0>) of role type named tpp_type
% Using role type
% Declaring tpp:(reg->(reg->Prop))
% FOF formula (<kernel.Constant object at 0x12937e8>, <kernel.DependentProduct object at 0x13c5d40>) of role type named ntpp_type
% Using role type
% Declaring ntpp:(reg->(reg->Prop))
% FOF formula (forall (X:reg), ((c X) X)) of role axiom named c_reflexive
% A new axiom: (forall (X:reg), ((c X) X))
% FOF formula (forall (X:reg) (Y:reg), (((c X) Y)->((c Y) X))) of role axiom named c_symmetric
% A new axiom: (forall (X:reg) (Y:reg), (((c X) Y)->((c Y) X)))
% FOF formula (((eq (reg->(reg->Prop))) dc) (fun (X:reg) (Y:reg)=> (((c X) Y)->False))) of role definition named dc
% A new definition: (((eq (reg->(reg->Prop))) dc) (fun (X:reg) (Y:reg)=> (((c X) Y)->False)))
% Defined: dc:=(fun (X:reg) (Y:reg)=> (((c X) Y)->False))
% FOF formula (((eq (reg->(reg->Prop))) p) (fun (X:reg) (Y:reg)=> (forall (Z:reg), (((c Z) X)->((c Z) Y))))) of role definition named p
% A new definition: (((eq (reg->(reg->Prop))) p) (fun (X:reg) (Y:reg)=> (forall (Z:reg), (((c Z) X)->((c Z) Y)))))
% Defined: p:=(fun (X:reg) (Y:reg)=> (forall (Z:reg), (((c Z) X)->((c Z) Y))))
% FOF formula (((eq (reg->(reg->Prop))) _TPTP_eq) (fun (X:reg) (Y:reg)=> ((and ((p X) Y)) ((p Y) X)))) of role definition named eq
% A new definition: (((eq (reg->(reg->Prop))) _TPTP_eq) (fun (X:reg) (Y:reg)=> ((and ((p X) Y)) ((p Y) X))))
% Defined: _TPTP_eq:=(fun (X:reg) (Y:reg)=> ((and ((p X) Y)) ((p Y) X)))
% FOF formula (((eq (reg->(reg->Prop))) o) (fun (X:reg) (Y:reg)=> ((ex reg) (fun (Z:reg)=> ((and ((p Z) X)) ((p Z) Y)))))) of role definition named o
% A new definition: (((eq (reg->(reg->Prop))) o) (fun (X:reg) (Y:reg)=> ((ex reg) (fun (Z:reg)=> ((and ((p Z) X)) ((p Z) Y))))))
% Defined: o:=(fun (X:reg) (Y:reg)=> ((ex reg) (fun (Z:reg)=> ((and ((p Z) X)) ((p Z) Y)))))
% FOF formula (((eq (reg->(reg->Prop))) po) (fun (X:reg) (Y:reg)=> ((and ((and ((o X) Y)) (((p X) Y)->False))) (((p Y) X)->False)))) of role definition named po
% A new definition: (((eq (reg->(reg->Prop))) po) (fun (X:reg) (Y:reg)=> ((and ((and ((o X) Y)) (((p X) Y)->False))) (((p Y) X)->False))))
% Defined: po:=(fun (X:reg) (Y:reg)=> ((and ((and ((o X) Y)) (((p X) Y)->False))) (((p Y) X)->False)))
% FOF formula (((eq (reg->(reg->Prop))) ec) (fun (X:reg) (Y:reg)=> ((and ((c X) Y)) (((o X) Y)->False)))) of role definition named ec
% A new definition: (((eq (reg->(reg->Prop))) ec) (fun (X:reg) (Y:reg)=> ((and ((c X) Y)) (((o X) Y)->False))))
% Defined: ec:=(fun (X:reg) (Y:reg)=> ((and ((c X) Y)) (((o X) Y)->False)))
% FOF formula (((eq (reg->(reg->Prop))) pp) (fun (X:reg) (Y:reg)=> ((and ((p X) Y)) (((p Y) X)->False)))) of role definition named pp
% A new definition: (((eq (reg->(reg->Prop))) pp) (fun (X:reg) (Y:reg)=> ((and ((p X) Y)) (((p Y) X)->False))))
% Defined: pp:=(fun (X:reg) (Y:reg)=> ((and ((p X) Y)) (((p Y) X)->False)))
% FOF formula (((eq (reg->(reg->Prop))) tpp) (fun (X:reg) (Y:reg)=> ((and ((pp X) Y)) ((ex reg) (fun (Z:reg)=> ((and ((ec Z) X)) ((ec Z) Y))))))) of role definition named tpp
% A new definition: (((eq (reg->(reg->Prop))) tpp) (fun (X:reg) (Y:reg)=> ((and ((pp X) Y)) ((ex reg) (fun (Z:reg)=> ((and ((ec Z) X)) ((ec Z) Y)))))))
% Defined: tpp:=(fun (X:reg) (Y:reg)=> ((and ((pp X) Y)) ((ex reg) (fun (Z:reg)=> ((and ((ec Z) X)) ((ec Z) Y))))))
% FOF formula (((eq (reg->(reg->Prop))) ntpp) (fun (X:reg) (Y:reg)=> ((and ((pp X) Y)) (((ex reg) (fun (Z:reg)=> ((and ((ec Z) X)) ((ec Z) Y))))->False)))) of role definition named ntpp
% A new definition: (((eq (reg->(reg->Prop))) ntpp) (fun (X:reg) (Y:reg)=> ((and ((pp X) Y)) (((ex reg) (fun (Z:reg)=> ((and ((ec Z) X)) ((ec Z) Y))))->False))))
% Defined: ntpp:=(fun (X:reg) (Y:reg)=> ((and ((pp X) Y)) (((ex reg) (fun (Z:reg)=> ((and ((ec Z) X)) ((ec Z) Y))))->False)))
% FOF formula (<kernel.Constant object at 0x13aadd0>, <kernel.Constant object at 0x13aaef0>) of role type named catalunya
% Using role type
% Declaring catalunya:reg
% FOF formula (<kernel.Constant object at 0x13aa638>, <kernel.Constant object at 0x13aaef0>) of role type named france
% Using role type
% Declaring france:reg
% FOF formula (<kernel.Constant object at 0x13aa518>, <kernel.Constant object at 0x13aaef0>) of role type named spain
% Using role type
% Declaring spain:reg
% FOF formula (<kernel.Constant object at 0x13aadd0>, <kernel.Constant object at 0x13aaef0>) of role type named paris
% Using role type
% Declaring paris:reg
% FOF formula ((tpp catalunya) spain) of role axiom named ax1
% A new axiom: ((tpp catalunya) spain)
% FOF formula ((ec spain) france) of role axiom named ax2
% A new axiom: ((ec spain) france)
% FOF formula ((ntpp paris) france) of role axiom named ax3
% A new axiom: ((ntpp paris) france)
% FOF formula ((and ((dc catalunya) paris)) ((dc spain) paris)) of role conjecture named con
% Conjecture to prove = ((and ((dc catalunya) paris)) ((dc spain) paris)):Prop
% We need to prove ['((and ((dc catalunya) paris)) ((dc spain) paris))']
% Parameter reg:Type.
% Parameter c:(reg->(reg->Prop)).
% Definition dc:=(fun (X:reg) (Y:reg)=> (((c X) Y)->False)):(reg->(reg->Prop)).
% Definition p:=(fun (X:reg) (Y:reg)=> (forall (Z:reg), (((c Z) X)->((c Z) Y)))):(reg->(reg->Prop)).
% Definition _TPTP_eq:=(fun (X:reg) (Y:reg)=> ((and ((p X) Y)) ((p Y) X))):(reg->(reg->Prop)).
% Definition o:=(fun (X:reg) (Y:reg)=> ((ex reg) (fun (Z:reg)=> ((and ((p Z) X)) ((p Z) Y))))):(reg->(reg->Prop)).
% Definition po:=(fun (X:reg) (Y:reg)=> ((and ((and ((o X) Y)) (((p X) Y)->False))) (((p Y) X)->False))):(reg->(reg->Prop)).
% Definition ec:=(fun (X:reg) (Y:reg)=> ((and ((c X) Y)) (((o X) Y)->False))):(reg->(reg->Prop)).
% Definition pp:=(fun (X:reg) (Y:reg)=> ((and ((p X) Y)) (((p Y) X)->False))):(reg->(reg->Prop)).
% Definition tpp:=(fun (X:reg) (Y:reg)=> ((and ((pp X) Y)) ((ex reg) (fun (Z:reg)=> ((and ((ec Z) X)) ((ec Z) Y)))))):(reg->(reg->Prop)).
% Definition ntpp:=(fun (X:reg) (Y:reg)=> ((and ((pp X) Y)) (((ex reg) (fun (Z:reg)=> ((and ((ec Z) X)) ((ec Z) Y))))->False))):(reg->(reg->Prop)).
% Axiom c_reflexive:(forall (X:reg), ((c X) X)).
% Axiom c_symmetric:(forall (X:reg) (Y:reg), (((c X) Y)->((c Y) X))).
% Parameter catalunya:reg.
% Parameter france:reg.
% Parameter spain:reg.
% Parameter paris:reg.
% Axiom ax1:((tpp catalunya) spain).
% Axiom ax2:((ec spain) france).
% Axiom ax3:((ntpp paris) france).
% Trying to prove ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found ((conj00 (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of (not ((c catalunya) paris))
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of (not ((c spain) paris))
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of (not ((c catalunya) paris))
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of (not ((c spain) paris))
% Found ((conj00 (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found (((conj0 (not ((c spain) paris))) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x40:False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of ((dc catalunya) paris)
% Found x40:False
% Found (fun (x5:((c spain) paris))=> x40) as proof of False
% Found (fun (x5:((c spain) paris))=> x40) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found ((conj00 (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found x40:False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of ((dc catalunya) paris)
% Found x40:False
% Found (fun (x5:((c spain) paris))=> x40) as proof of False
% Found (fun (x5:((c spain) paris))=> x40) as proof of ((dc spain) paris)
% Found ((conj00 (fun (x5:((c catalunya) paris))=> x40)) (fun (x5:((c spain) paris))=> x40)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x40)) (fun (x5:((c spain) paris))=> x40)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x40)) (fun (x5:((c spain) paris))=> x40)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x40)) (fun (x5:((c spain) paris))=> x40)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found ((conj00 (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of (not ((c catalunya) paris))
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of (not ((c spain) paris))
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found ((conj00 (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (fun (x4:((and ((ec x3) catalunya)) ((ec x3) spain)))=> ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20))) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (fun (x4:((and ((ec x3) catalunya)) ((ec x3) spain)))=> ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20))) as proof of (((and ((ec x3) catalunya)) ((ec x3) spain))->((and ((dc catalunya) paris)) ((dc spain) paris)))
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of (not ((c catalunya) paris))
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of (not ((c spain) paris))
% Found x40:False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of (not ((c catalunya) paris))
% Found x40:False
% Found (fun (x5:((c spain) paris))=> x40) as proof of False
% Found (fun (x5:((c spain) paris))=> x40) as proof of (not ((c spain) paris))
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of (not ((c spain) paris))
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of (not ((c catalunya) paris))
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found ((conj00 (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (fun (x4:((and ((ec x3) catalunya)) ((ec x3) spain)))=> ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20))) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (fun (x3:reg) (x4:((and ((ec x3) catalunya)) ((ec x3) spain)))=> ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20))) as proof of (((and ((ec x3) catalunya)) ((ec x3) spain))->((and ((dc catalunya) paris)) ((dc spain) paris)))
% Found (fun (x3:reg) (x4:((and ((ec x3) catalunya)) ((ec x3) spain)))=> ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20))) as proof of (forall (x:reg), (((and ((ec x) catalunya)) ((ec x) spain))->((and ((dc catalunya) paris)) ((dc spain) paris))))
% Found x60:False
% Found (fun (x7:((c catalunya) paris))=> x60) as proof of False
% Found (fun (x7:((c catalunya) paris))=> x60) as proof of ((dc catalunya) paris)
% Found x60:False
% Found (fun (x7:((c spain) paris))=> x60) as proof of False
% Found (fun (x7:((c spain) paris))=> x60) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x3:((c spain) paris))=> x20) as proof of False
% Found (fun (x3:((c spain) paris))=> x20) as proof of (not ((c spain) paris))
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of (not ((c catalunya) paris))
% Found ((conj00 (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found (((conj0 (not ((c spain) paris))) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x3:((c catalunya) paris))=> x20)) (fun (x3:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found x60:False
% Found (fun (x7:((c catalunya) paris))=> x60) as proof of False
% Found (fun (x7:((c catalunya) paris))=> x60) as proof of ((dc catalunya) paris)
% Found x60:False
% Found (fun (x7:((c spain) paris))=> x60) as proof of False
% Found (fun (x7:((c spain) paris))=> x60) as proof of ((dc spain) paris)
% Found x00:False
% Found (fun (x1:((c spain) paris))=> x00) as proof of False
% Found (fun (x1:((c spain) paris))=> x00) as proof of ((dc spain) paris)
% Found x00:False
% Found (fun (x1:((c catalunya) paris))=> x00) as proof of False
% Found (fun (x1:((c catalunya) paris))=> x00) as proof of ((dc catalunya) paris)
% Found x00:False
% Found (fun (x1:((c spain) paris))=> x00) as proof of False
% Found (fun (x1:((c spain) paris))=> x00) as proof of ((dc spain) paris)
% Found x00:False
% Found (fun (x1:((c catalunya) paris))=> x00) as proof of False
% Found (fun (x1:((c catalunya) paris))=> x00) as proof of ((dc catalunya) paris)
% Found x40:False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of (not ((c catalunya) paris))
% Found x40:False
% Found (fun (x5:((c spain) paris))=> x40) as proof of False
% Found (fun (x5:((c spain) paris))=> x40) as proof of (not ((c spain) paris))
% Found ((conj00 (fun (x5:((c catalunya) paris))=> x40)) (fun (x5:((c spain) paris))=> x40)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found (((conj0 (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x40)) (fun (x5:((c spain) paris))=> x40)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x40)) (fun (x5:((c spain) paris))=> x40)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x40)) (fun (x5:((c spain) paris))=> x40)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of (not ((c catalunya) paris))
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of (not ((c spain) paris))
% Found ((conj00 (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found (((conj0 (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found x4:((c Z) x3)
% Instantiate: x3:=france:reg
% Found (fun (x4:((c Z) x3))=> x4) as proof of ((c Z) france)
% Found (fun (Z:reg) (x4:((c Z) x3))=> x4) as proof of (((c Z) x3)->((c Z) france))
% Found (fun (Z:reg) (x4:((c Z) x3))=> x4) as proof of ((p x3) france)
% Found x4:((c Z) x3)
% Instantiate: x3:=spain:reg
% Found (fun (x4:((c Z) x3))=> x4) as proof of ((c Z) spain)
% Found (fun (Z:reg) (x4:((c Z) x3))=> x4) as proof of (((c Z) x3)->((c Z) spain))
% Found (fun (Z:reg) (x4:((c Z) x3))=> x4) as proof of ((p x3) spain)
% Found x20:False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x3:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x60:False
% Found (fun (x7:((c spain) paris))=> x60) as proof of False
% Found (fun (x7:((c spain) paris))=> x60) as proof of ((dc spain) paris)
% Found x60:False
% Found (fun (x7:((c catalunya) paris))=> x60) as proof of False
% Found (fun (x7:((c catalunya) paris))=> x60) as proof of ((dc catalunya) paris)
% Found ((conj00 (fun (x7:((c catalunya) paris))=> x60)) (fun (x7:((c spain) paris))=> x60)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x7:((c catalunya) paris))=> x60)) (fun (x7:((c spain) paris))=> x60)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x7:((c catalunya) paris))=> x60)) (fun (x7:((c spain) paris))=> x60)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x7:((c catalunya) paris))=> x60)) (fun (x7:((c spain) paris))=> x60)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found x40:False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of ((dc catalunya) paris)
% Found x40:False
% Found (fun (x5:((c spain) paris))=> x40) as proof of False
% Found (fun (x5:((c spain) paris))=> x40) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of (not ((c catalunya) paris))
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of (not ((c spain) paris))
% Found ((conj00 (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found (((conj0 (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20)) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found (fun (x4:((and ((ec x3) catalunya)) ((ec x3) spain)))=> ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20))) as proof of ((and (not ((c catalunya) paris))) (not ((c spain) paris)))
% Found (fun (x4:((and ((ec x3) catalunya)) ((ec x3) spain)))=> ((((conj (not ((c catalunya) paris))) (not ((c spain) paris))) (fun (x5:((c catalunya) paris))=> x20)) (fun (x5:((c spain) paris))=> x20))) as proof of (((and ((ec x3) catalunya)) ((ec x3) spain))->((and (not ((c catalunya) paris))) (not ((c spain) paris))))
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x60:False
% Found (fun (x7:((c catalunya) paris))=> x60) as proof of False
% Found (fun (x7:((c catalunya) paris))=> x60) as proof of ((dc catalunya) paris)
% Found x60:False
% Found (fun (x7:((c spain) paris))=> x60) as proof of False
% Found (fun (x7:((c spain) paris))=> x60) as proof of ((dc spain) paris)
% Found ((conj00 (fun (x7:((c catalunya) paris))=> x60)) (fun (x7:((c spain) paris))=> x60)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x7:((c catalunya) paris))=> x60)) (fun (x7:((c spain) paris))=> x60)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x7:((c catalunya) paris))=> x60)) (fun (x7:((c spain) paris))=> x60)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x7:((c catalunya) paris))=> x60)) (fun (x7:((c spain) paris))=> x60)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found x40:False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x7:((c spain) paris))=> x20) as proof of False
% Found (fun (x7:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x7:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x7:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x40:False
% Found (fun (x5:((c spain) paris))=> x40) as proof of False
% Found (fun (x5:((c spain) paris))=> x40) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x40:False
% Found (fun (x5:((c spain) paris))=> x40) as proof of False
% Found (fun (x5:((c spain) paris))=> x40) as proof of ((dc spain) paris)
% Found x40:False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x40) as proof of ((dc catalunya) paris)
% Found x20:False
% Found (fun (x5:((c spain) paris))=> x20) as proof of False
% Found (fun (x5:((c spain) paris))=> x20) as proof of ((dc spain) paris)
% Found x20:False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of False
% Found (fun (x5:((c catalunya) paris))=> x20) as proof of ((dc catalunya) paris)
% Found x00:False
% Found (fun (x1:((c catalunya) paris))=> x00) as proof of False
% Found (fun (x1:((c catalunya) paris))=> x00) as proof of ((dc catalunya) paris)
% Found x00:False
% Found (fun (x1:((c spain) paris))=> x00) as proof of False
% Found (fun (x1:((c spain) paris))=> x00) as proof of ((dc spain) paris)
% Found ((conj00 (fun (x1:((c catalunya) paris))=> x00)) (fun (x1:((c spain) paris))=> x00)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x1:((c catalunya) paris))=> x00)) (fun (x1:((c spain) paris))=> x00)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x1:((c catalunya) paris))=> x00)) (fun (x1:((c spain) paris))=> x00)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x1:((c catalunya) paris))=> x00)) (fun (x1:((c spain) paris))=> x00)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found x20:False
% Found (fun (x5:((and ((ec x4) catalunya)) ((ec x4) spain)))=> x20) as proof of False
% Found (fun (x5:((and ((ec x4) catalunya)) ((ec x4) spain)))=> x20) as proof of (((and ((ec x4) catalunya)) ((ec x4) spain))->False)
% Found x20:False
% Found (fun (x5:((and ((ec x4) catalunya)) ((ec x4) spain)))=> x20) as proof of False
% Found (fun (x5:((and ((ec x4) catalunya)) ((ec x4) spain)))=> x20) as proof of (((and ((ec x4) catalunya)) ((ec x4) spain))->False)
% Found x00:False
% Found (fun (x1:((c catalunya) paris))=> x00) as proof of False
% Found (fun (x1:((c catalunya) paris))=> x00) as proof of ((dc catalunya) paris)
% Found x00:False
% Found (fun (x1:((c spain) paris))=> x00) as proof of False
% Found (fun (x1:((c spain) paris))=> x00) as proof of ((dc spain) paris)
% Found ((conj00 (fun (x1:((c catalunya) paris))=> x00)) (fun (x1:((c spain) paris))=> x00)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found (((conj0 ((dc spain) paris)) (fun (x1:((c catalunya) paris))=> x00)) (fun (x1:((c spain) paris))=> x00)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc spain) paris)) (fun (x1:((c catalunya) paris))=> x00)) (fun (x1:((c spain) paris))=> x00)) as proof of ((and ((dc catalunya) paris)) ((dc spain) paris))
% Found ((((conj ((dc catalunya) paris)) ((dc 
% EOF
%------------------------------------------------------------------------------